A computational approach for edge linking

EÆcient edge operators such as those based on partial derivatives fail to return continuous edge maps. To address this, a supplementary edge linking step is required to complete the initial edge information. In this paper we propose a fast and eÆcient algorithm for edge linking using the local information around edge terminators. In order to minimise incorrect linking decisions, the direction and the linking path for each edge terminator is established by minimising a cost function. The particular novelty of this approach lies in the labelling scheme which assigns the directionality of the edge terminators (endpoints) based only on local knowledge. As a consequence, it relaxes the demand of a priori knowledge and furthermore assures an accurate and eÆcient search for edge paths in the image.